The construction of subsquare free Latin squares by simulated annealing
نویسندگان
چکیده
A simulated annealing algorithm is used in the construction of subsquare free Latin squares. The algorithm is described and experience from its application is reported. Results obtained include the construction of subsquare free Latin squares of orders 16 and 18, the smallest orders for which existence of such squares was previously in doubt.
منابع مشابه
Subsquare-free Latin squares of odd order
For every odd positive integer m we prove the existence of a Latin square of order 3m having no proper Latin subsquares. Combining this with previously known results it follows that subsquare-free Latin squares exist for all odd orders. © 2005 Elsevier Ltd. All rights reserved.
متن کاملSymmetries That Latin Squares Inherit from 1-Factorizations
A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect matchings. There is a well-known method, which we call the K-construction, for building a 1-factorization of Kn;n from a 1-factorization of Knþ1. The 1-factorization of Kn;n can be written as a latin square of order n. The K-construction has been used, among other things, to make perfect 1-factorizations, su...
متن کاملDiagonally cyclic latin squares
A latin square of order n possessing a cyclic automorphism of order n is said to be diagonally cyclic because its entries occur in cyclic order down each broken diagonal. More generally, we consider squares possessing any cyclic automorphism. Such squares will be named after Parker, in recognition of his seminal contribution to the study of orthogonal latin squares. Our primary aim is to survey...
متن کاملA Mushy State Simulated Annealing
It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...
متن کاملA Mushy State Simulated Annealing
It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 5 شماره
صفحات -
تاریخ انتشار 1992